Search results for "Duration time"

showing 1 items of 1 documents

On the hardness of evaluating criticality of activities in a planar network with duration intervals

2003

Complexity results for problems of evaluating the criticality of activities in planar networks with duration time intervals are presented. We show that the problems of asserting whether an activity is possibly critical, and of computing bounds on the float of an activity in these networks are NP-complete and NP-hard, respectively.

Planar networkFloat (project management)PlanarCriticalityComputer scienceDuration timeApplied MathematicsReal-time computingManagement Science and Operations ResearchDuration (project management)Industrial and Manufacturing EngineeringSoftwareSimulationOperations Research Letters
researchProduct